Comment on "Phylogenetic MCMC algorithms are misleading on mixtures of trees".
نویسندگان
چکیده
Mossel and Vigoda (Reports, 30 September 2005, p. 2207) show that nearest neighbor interchange transitions, commonly used in phylogenetic Markov chain Monte Carlo (MCMC) algorithms, perform poorly on mixtures of dissimilar trees. However, the conditions leading to their results are artificial. Standard MCMC convergence diagnostics would detect the problem in real data, and correction of the model misspecification would solve it.
منابع مشابه
Phylogenetic MCMC algorithms are misleading on mixtures of trees.
Markov chain Monte Carlo (MCMC) algorithms play a critical role in the Bayesian approach to phylogenetic inference. We present a theoretical analysis of the rate of convergence of many of the widely used Markov chains. For N characters generated from a uniform mixture of two trees, we prove that the Markov chains take an exponentially long (in N) number of iterations to converge to the posterio...
متن کاملSupporting Online Material for Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees
Markov Chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov Chains widely used in phylogenetic inference. We analyze simple, realistic examples where these Markov chains fail to converge quickly. In particular, the studied data is generated from a ...
متن کاملAWTY (are we there yet?): a system for graphical exploration of MCMC convergence in Bayesian phylogenetics
UNLABELLED A key element to a successful Markov chain Monte Carlo (MCMC) inference is the programming and run performance of the Markov chain. However, the explicit use of quality assessments of the MCMC simulations-convergence diagnostics-in phylogenetics is still uncommon. Here, we present a simple tool that uses the output from MCMC simulations and visualizes a number of properties of primar...
متن کاملBayesian Models for Phylogenetic trees
introduction: inferring genetic ancestry of different species is a current challenge in phylogenetics because of the immense raw biological data to be analyzed. computational techniques are necessary in order to parse and analyze all of such data in an efficient but accurate way, with many algorithms based on statistical principles designed to provide a best estimate of a phylogenetic topology....
متن کاملEvaluation of proposal distributions on clock-constrained trees in Bayesian phylogenetic inference
Bayesian Markov chain Monte Carlo (MCMC) has become one of the principle methods of performing phylogenetic inference. Implementing the Markov chain Monte Carlo algorithm requires the definition of a proposal distribution which defines a transition kernel over the state space. The precise form of this transition kernel has a large impact on the computational efficiency of the algorithm. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Science
دوره 312 5772 شماره
صفحات -
تاریخ انتشار 2006